Vertex-transitive triangulations of compact orientable 2-manifolds

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An infinite family of tight triangulations of manifolds

We give explicit construction of vertex-transitive tight triangulations of d-manifolds for d ≥ 2. More explicitly, for each d ≥ 2, we construct two (d + 5d + 5)-vertex neighborly triangulated d-manifolds whose vertex-links are stacked spheres. The only other non-trivial series of such tight triangulated manifolds currently known is the series of non-simply connected triangulated d-manifolds wit...

متن کامل

Irreducible triangulations of 2-manifolds with boundary

This is a talk on joint work with Maŕıa José Chávez, Seiya Negami, Antonio Quintero, and Maŕıa Trinidad Villar. A triangulation of a 2-manifold M is a simplicial 2-complex with underlying space homeomorphic to M . The operation of contraction of an edge e in a triangulation T of M is the operation which consists in contracting e to a single vertex and collapsing each face that meets e to a sing...

متن کامل

Finite vertex-primitive and vertex-biprimitive 2-path-transitive graphs

This paper presents a classification of vertex-primitive and vertex-biprimitive 2-path-transitive graphs which are not 2-arc-transitive. The classification leads to constructions of new examples of half-arc-transitive graphs.

متن کامل

M ar 2 00 7 A 27 - vertex graph that is vertex - transitive and edge - transitive but not l - transitive

I describe a 27-vertex graph that is vertex-transitive and edgetransitive but not 1-transitive. Thus while all vertices and edges of this graph are similar, there are no edge-reversing automorphisms. A graph (undirected, without loops or multiple edges) is said to be vertextransitive if its automorphism group acts transitively on the set of vertices, edge-transitive if its automorphism group ac...

متن کامل

Triangulations of Manifolds

In topology, a basic building block for spaces is the n-simplex. A 0-simplex is a point, a 1-simplex is a closed interval, a 2-simplex is a triangle, and a 3-simplex is a tetrahedron. In general, an n-simplex is the convex hull of n + 1 vertices in n-dimensional space. One constructs more complicated spaces by gluing together several simplices along their faces, and a space constructed in this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1985

ISSN: 0095-8956

DOI: 10.1016/0095-8956(85)90062-0